#region Using Directives and Copyright Notice

// Copyright (c) 2007-2010, Computer Consultancy Pty Ltd
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of the Computer Consultancy Pty Ltd nor the
//       names of its contributors may be used to endorse or promote products
//       derived from this software without specific prior written permission.
// 
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
// ARE DISCLAIMED. IN NO EVENT SHALL COMPUTER CONSULTANCY PTY LTD BE LIABLE 
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.

using System;
using System.Configuration;
using System.Data;
using System.Web;

#endregion

namespace Interlace.Differencing
{
    public enum OpCodeOperation
    {
        None,
        Equal,
        Replace,
        Delete,
        Insert,
    }

    public struct OpCode
    {
        public OpCodeOperation operation;
        public int leftStart;
        public int leftEnd;
        public int rightStart;
        public int rightEnd;

        public OpCode(OpCodeOperation newOperation, int newLeftStart, int newLeftEnd, int newRightStart, int newRightEnd)
        {
            operation = newOperation;
            leftStart = newLeftStart;
            leftEnd = newLeftEnd;
            rightStart = newRightStart;
            rightEnd = newRightEnd;
        }

        public override bool Equals(object obj)
        {
            if (!(obj is OpCode)) return false;
            OpCode rhs = (OpCode)obj;

            return
                operation == rhs.operation &&
                leftStart == rhs.leftStart &&
                leftEnd == rhs.leftEnd &&
                rightStart == rhs.rightStart &&
                rightEnd == rhs.rightEnd;
        }

        public int leftLength
        {
            get { return leftEnd - leftStart; }
        }

        public int rightLength
        {
            get { return rightEnd - rightStart; }
        }

        public override int GetHashCode()
        {
            return (int)operation ^ leftStart ^ leftEnd ^ rightStart ^ rightEnd;
        }
    }
}
